Method and controller for processing data multiplication in RAID system

ABSTRACT

The invention discloses a method and controller for processing data multiplication in a RAID system. Map tables are generated for all values in a field, respectively. The length of an XOR operation unit is chosen to be appropriate w bits (e.g., 32 bits or 64 bits). One or several XOR operation units form a multiplication unit of a data sector. When computing on-line, data in a disk drive of a disk array are performed with XOR operations in accordance with one of the map tables using an XOR operation unit as one unit while computing on the multiplication unit to obtain a product of multiplication. Making use of the RAID system established according to the disclosed method, only XOR operations are required to compute parity data or recover damaged user data. Moreover, several calculations can be performed simultaneously. Therefore, the efficiency of the RAID system can be effectively improved.

RELATED APPLICATIONS

This application claims priority to provisional patent application serial number 60/596,142, filed Sep. 2, 2005, and entitled “Method And Controller For Processing Data Multiplication In RAID System”, which is incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of Invention

The invention relates to a method and controller for processing data multiplication in a RAID system and, in particular, to a method and controller for processing simultaneously a large amount of data multiplication operations in a RAID system.

2. Related Art

The redundant array of independent disk (RAID) is a disk subsystem designed to enhance access efficiency, to provide better fault-tolerance ability, or both. The RAID utilizes a disk striping technique to enhance the access efficiency. Data are stored separately according to bytes or groups of bytes in many different disk drives, so that the read/write I/O requests can be performed in parallel on many disk drives. On the other hand, a mirroring technique or a disk striping technique with distributive parity data is used to provide the fault-tolerance ability.

The ability of fault tolerance is related to the number of parity data sets stored in the RAID system. Taking RAID5 as an example, it is designed to store an extra set of parity data in addition to the user data. The parity data is usually called the P value, or sometimes the XOR parity because it is the calculation result of XOR operations on the corresponding user data. The formula is: P=D ₀ +D ₁ +D ₂ +. . . +D _(n−1)   (1) where + represents the XOR operation, P represents the parity data series, D₀, D₁, D₂, . . . , D_(n−1) represents the user data series, respectively, and n denotes the number of user data disks. As RAID5 only stores one parity data set, it can only allow one of the user data disks having errors (e.g. damaged or out of order) at a time. The data on the user data disk having errors is recovered using the corresponding P value and the corresponding data on the other normal user data disks by means of the same XOR operations. For example, if D₁ has an error, then D₁ can be recovered as follows: D ₁ =D ₀ +D ₂ +. . . +D _(n−1) +P

-   -   where + also denotes the XOR operation.

Considering the fault tolerance demand on more than one user data disk, some systems are designed to store multiple parities. “Reed-Solomon Codes” are usually adopted to set up this type of RAID systems, which allow more than one disk drive having errors. RAID6 belongs to this category. It has at least two parities to allow two or more disk drives having errors at the same time.

Take the RAID6 system with two parities as an example. The two parities are conventionally called P and Q. The formula for computing P is the same as the one in the RAID5 system. The value of Q is obtained using the following formula. Q=g ⁰ ·D ₀ +g ¹ ·D ₁ +g ² ·D ₂ +. . . +g ^(n−1) ·D _(n−1)   (2)

If two data disks D_(x), D_(y) are damaged, then a careful derivation gives: D _(x) =A·(P+P _(xy))+B·(Q+Q _(xy))   (3) D _(y)=(P+P _(xy))+D _(x)   (4)

-   -   where A and B are constants only related to x and y:         A=g ^(y−x)·(g ^(y−x)+1)⁻¹   (5)         B=g ^(−x)·(g ^(y−x)+1)⁻¹   (6)     -   and P_(xy) and Q_(xy) are the values of P and Q when both D_(x)         and D_(y) are 0, i.e.,         P _(xy) +D _(x) +D _(y) =P   (7)         Q _(xy) +g ^(x) ·D _(x) +g ^(y) ·D _(y) =Q   (8)

Aside from the fact that the power “y−x” is a normal subtraction, the other algebraic operations in Eqs. (2) to (8) are all operations following the rules of the Galois Field. Moreover, g is a generator of the Galois Field. It usually be chosen as g=2.

The addition operation in the Galois Field is in fact the XOR operation. Its multiplication operation is related to the field of GF(2^(a)). For the definitions, properties, and operational rules, please refer to (1) “The mathematics of RAID6”, H. Peter Anvin, December, 2004; and (2) “A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems”, James S. Plank, Software-Practice & Experience, 27(9), pp 995-1012, September, 1997. Eqs. (1) to (8) given above can be found in Ref. (1).

Since the Galois Field is a closed field and there always exists an r for an arbitrary number X satisfying X=2^(r), in the prior art looking up table is a typical method to deal with the multiplication operations in the Galois Field (see Ref. (2)). Take GF(2^(a)) as an example. To find the product of any two numbers X and Y, the procedure is as follows:

-   -   1. Look up a log table to find r and s, which satisfies X=2^(r)         and Y=2^(s).

Therefore, X·Y=2^(r+s)=2^(t).

-   -   2. If t≧2^(a)−1, then t=t−(2^(a)−1).     -   3. Look up an inverse log table to obtain the value of 2^(t).

It is seen from Eqs. (2) and (3) that a large amount of multiplication operations of Galois Field are required for computing Q or recovering the damaged D_(x). In particular, it involves the multiplication of a constant with various different numbers. By means of the conventional method of looking up table, the system has to compute byte by byte and each multiplication operation of Galois Field requires 3 times of table looking up, 1 addition (or subtraction), 1 test and 1 modulo operation. Considering that the sizes of current storage media are frequently tens or hundreds of Giga bytes, such calculations are very inefficient and easy to become the bottleneck of the system. Therefore, how to improve and/or simplify and/or speed up the data multiplication operations in the RAID system is an important issue to be solved in the industry.

SUMMARY OF THE INVENTION

It is an objective of the invention to provide an effective algorithm and a controller implementing the algorithm, so that a huge amount of data multiplication operations can be performed simultaneously, thereby improving the efficiency of a RAID system.

In accordance with one feature of the invention, a method for data multiplication operations in a RAID system is provided. The method includes the steps of: generating at least one map table corresponding to at least one value in a field; selecting a length for an XOR operation unit and forming a multiplication unit using a plurality of the XOR operation units; and for the data stored in one disk drive of the RAID, performing at least one XOR operation using the XOR operation unit as one unit while computing on the multiplication unit according to a map table of the at least one map table, and further performing a plurality of the XOR operations to obtain the multiplication result.

In accordance with another feature of the invention, a controller for processing data multiplication operations in the RAID system is provided. The controller includes: a memory for temporarily storing target data provided by a data source; and a central processing circuit that generates at least one map table corresponding to at least one value in a field, performs at least one XOR operation for the target data stored in the memory using the XOR operation unit as one unit while computing on the multiplication unit according to a map table of the at least one map table, and further performs a plurality of the XOR operations to obtain the multiplication result.

In accordance with another feature of the invention, a method for processing data multiplication operations in a RAID system is provided, which is used to compute the product of a number K with a data series X. The method includes the steps of: generating a map table for the number K; selecting a length of an XOR operation unit, and forming a multiplication unit using a plurality of the XOR operation units; dividing the data series X into at least one the multiplication unit; for the multiplication unit and the map table associated with the number K, performing at least one XOR operation using the XOR operation unit as one unit according to the rules in the map table; and performing the multiplication operation in the previous step on all the multiplication units in the data series X. The multiplication result of the number K with the data series X is obtained once all the multiplication operations are done.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other features, aspects and advantages of the invention will become apparent by reference to the following description and accompanying drawings which are given by way of illustration only, and thus are not limitative of the invention, and wherein:

FIG. 1 is the primary flowchart of the invention;

FIG. 2 is a flowchart of generating map tables according to the invention;

FIG. 3 is a schematic view of sampling data according to the invention;

FIG. 4 is a schematic view of sampling data in the prior art; and

FIG. 5 is a schematic view of an embodiment of the disclosed disk subsystem employing the method of the invention.

DETAILED DESCRIPTION OF THE INVENTION

The present invention will be apparent from the following detailed description, which proceeds with reference to the accompanying drawings, wherein the same references relate to the same elements.

A feature of the invention is in the appropriate definitions of operational rules for the data in the RAID system in order to speed up the data operations. In practice, the operational rules for the RAID data are commonly taken to be the algebraic rules of the Galois Field. Therefore, the algebraic rules of the Galois Field are used in the following embodiments. One embodiment of the invention is established on the hypothesis of GF(2^(a)) of the Galois Field and its related algebraic rules. As a=8 is a currently-preferred choice in practice, most of the embodiments in this specification assume the domain of the Galois Field to be GF(2⁸). That is, the covered numbers are between 0 and 255. This is because 2⁸ is exactly the amount represented by one byte which is a basic unit of computer memory. The RAID system accordingly established can accommodate up to 255 user data disks, which are sufficient for normal RAID systems. Although the embodiments in this specification assume GF(2⁸), the invention can be applied to other cases with other hypotheses. In other embodiments of the invention, the disclosed technique may be applied in a Galois field domain different from GF(2⁸). Moreover, the invention can also use the operations in other fields or number systems, as long as appropriate operational rules are found in those fields or number systems.

Most of the embodiments described below take a RAID6 system with two parities as the example. However, the invention can be applied to more general cases. Other RAID 6 systems with more than two parities can be implemented with the disclosed method as well. The conventional formulas quoted in the specification are listed as follows. P=D ₀ +D ₁ +D ₂ +. . . +D _(n−1)   (1) Q=g ⁰ ·D ₀ +g ¹ ·D ₁ +g ² ·D ₂ +. . . +g ^(n−1) ·D _(n−1)   (2) D _(x) =A·(P+P _(xy))+B·(Q+Q _(xy))   (3) D _(y)=(P+P _(xy))+D _(x)   (4) A=g ^(y−x)·(g ^(y−x)+1)⁻¹   (5) B=g ^(−x)·(g ^(y−x)+1)⁻¹   (6) where P and Q are the two parities in the RAID6 system; x and y are the serial numbers of the two data disks with errors; D_(x) and D_(y) are the user data corresponding to the two data disks x and y; A and B are constants only related to x and y; and P_(xy) and Q_(xy) are the values of P and Q when D_(x) and D_(y) are both 0, i.e., P _(xy) +D _(x) +D _(y) =P   (7) Q _(xy) +g ^(x) ·D _(x) +g ^(y) ·D _(y) =Q   (8)

Aside from the fact that the power “y−x” is a normal subtraction, the other algebraic operations in Eqs. (1) to (8) are all operations following the rules of the Galois Field. Moreover, g is a generator of the Galois Field. It usually be chosen as g=2.

Definition of the Map Table

The map table is a key ingredient of the invention. It is defined as follows.

Suppose Y, X, and K are numbers in GF(2^(a)). That is, Y, X, and K are all composed of “a” bits. If y_(i) and x_(i) represents the i-th bits of Y and X, respectively, then the vectors Y and X can be represented by: ${Y = \begin{bmatrix} y_{0} \\ y_{1} \\ y_{2} \\ \vdots \\ y_{a - 1} \end{bmatrix}},{X = \begin{bmatrix} x_{0} \\ x_{1} \\ x_{2} \\ \vdots \\ x_{a - 1} \end{bmatrix}}$

Let Y=K·X; that is, Y is the multiplication result of K with an arbitrary number X in the Galois Field. Here K is a given constant. Then the map table of K is defined as an a×a matrix M_(K), whose elements m_(i,j) (0<=i, j<=a−1) are 0 or 1 and satisfy: $\begin{matrix} \begin{matrix} {Y = \begin{bmatrix} y_{0} \\ y_{1} \\ y_{2} \\ \vdots \\ y_{a - 1} \end{bmatrix}} \\ {= {M_{K} \cdot X}} \\ {= {\begin{bmatrix} m_{0,0} & m_{0,1} & m_{0,2} & \cdots & m_{0,{a - 1}} \\ m_{1,0} & m_{1,1} & m_{1,2} & \cdots & m_{1,{a - 1}} \\ m_{2,0} & m_{2,1} & m_{2,2} & \cdots & m_{2,{a - 1}} \\ \vdots & \vdots & \vdots & \quad & \vdots \\ m_{{a - 1},0} & m_{{a - 1},1} & m_{{a - 1},2} & \cdots & m_{{a - 1},{a - 1}} \end{bmatrix}_{K} \cdot \begin{bmatrix} x_{0} \\ x_{1} \\ x_{2} \\ \vdots \\ x_{a - 1} \end{bmatrix}}} \end{matrix} & (9) \end{matrix}$

In other words, $\begin{matrix} {{{y_{i} = {\sum\limits_{j = 0}^{a - 1}\left( {m_{i,j} \cdot x_{j}} \right)}},{wherein}}{0 \leqq i \leqq {a - 1}}{where}{{{m_{i,j} \cdot x_{j}} = x_{j}},{if}}{{m_{i,j} = 1};}{{{m_{i,j} \cdot x_{j}} = 0},{if}}{m_{i,j} = 0.}} & (10) \end{matrix}$

The addition in the above operations is defined as the XOR operation. Since the elements in the matrix M_(K) are either 0 or 1, the computation of y_(i) can be regarded as follows: the data units x_(j) corresponding to m_(i,j)=1 in the i-th row of the matrix M_(K) are selected to do XOR operations.

Generation of the Map Table

The way of generating the map table is closely related to the algebraic rules of the Galois Field. Take GF(2⁸) as an example. Suppose the product of an arbitrary number X and 2 is X′, then X″ can be obtained from the following formula (“+” represents an XOR operation): ${X^{\prime} = {\begin{bmatrix} x_{0}^{\prime} \\ x_{1}^{\prime} \\ x_{2}^{\prime} \\ x_{3}^{\prime} \\ x_{4}^{\prime} \\ x_{5}^{\prime} \\ x_{6}^{\prime} \\ x_{7}^{\prime} \end{bmatrix} = \begin{bmatrix} x_{7} \\ x_{0} \\ {x_{1} + x_{7}} \\ {x_{2} + x_{7}} \\ {x_{3} + x_{7}} \\ x_{4} \\ x_{5} \\ x_{6} \end{bmatrix}}};\quad{{{where}\quad X} = \begin{bmatrix} x_{0} \\ x_{1} \\ x_{2} \\ x_{3} \\ x_{4} \\ x_{5} \\ x_{6} \\ x_{7} \end{bmatrix}}$

Suppose the map table of K is a given matrix M_(K) and the map table of K′=2·K is the matrix M_(K′). Based on the above formula, one can derive the algorithmic rule A for generating M_(K′) from M_(K), shown in Table 1: TABLE 1 m′_(0j) = m_(7j), 0 <= j <= 7 m′_(1j) = m_(0j), 0 <= j <= 7 m′_(2j) = m_(1j) + m_(7j), 0 <= j <= 7 m′_(3j) = m_(2j) + m_(7j), 0 <= j <= 7 m′_(4j) = m_(3j) + m_(7j), 0 <= j <= 7 m′_(5j) = m_(4j), 0 <= j <= 7 m′_(6j) = m_(5j), 0 <= j <= 7 m′_(7j) = m_(6j), 0 <= j <= 7

One algebraic feature of the Galois Field is as follows. Start from K=1 and multiply K each time by 2. The derived new K values do not repeat until covering all the numbers in the Galois Field. Take GF(2⁸) as an example. Start from K=1 and record it. Multiply K by 2 each time. After 255 times recording, the derived K values will cover all the GF(2⁸) numbers (except for 0).

According to the above-mentioned algebraic properties of the Galois Field and the algorithmic rule A, all map tables corresponding to different K values, i.e., all the matrix M_(K), can be generated. Please refer to FIG. 1. According to an embodiment of the invention, generating the map tables (step 200) is the first key step of the invention and its implementation is described as follows.

With reference to FIG. 2, while beginning to generate the map tables (step 201), the algorithmic rule A for generating the matrix M_(K′) from the matrix M_(K) should be determined first according to the selected Galois Field GF(2^(a)) and its algebraic rules (step 202), where M_(K) denotes the map table of a constant K and M_(K′) denotes the map table of 2·K. When K=0, its map table is defined to be the zero matrix (step 203). When K=1, its map table is defined to be the identity matrix (step 204). The map tables thus generated are stored in the system memory. The K value whose map table is already produced is marked as “completed” (step 205). Afterwards, K starts from K=1 and is multiplied each time by 2 (step 206). The system checks whether the K value is marked as “completed” (step 207). If so, then the procedure is finished (step 209); otherwise, the map table M_(K) of the new K value is generated according to the algorithmic rule A (step 208). The procedure then returns to step 205, marking K as “completed” and generating the next new K value (step 206), and so on. Steps 205˜208 are repeated until K value is repeated and then the procedure is finished (step 209).

A few map tables in GF(2⁸) are listed below for references. $\begin{matrix} {K = 0} & {K = {2^{0} = 1}} \\ {M_{0} = \begin{bmatrix} 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \end{bmatrix}} & {M_{1} = \begin{bmatrix} 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{bmatrix}} \\ {K = {2^{27} = 12}} & {K = {2^{55} = 160}} \\ {M_{12} = \begin{bmatrix} 1 & 1 & 1 & 0 & 0 & 0 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 & 0 & 0 & 1 \\ 1 & 1 & 0 & 1 & 1 & 0 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 & 1 & 1 & 1 \\ 0 & 0 & 1 & 0 & 0 & 1 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 & 0 & 0 & 1 \\ 1 & 1 & 0 & 0 & 0 & 1 & 0 & 0 \end{bmatrix}} & {M_{160} = \begin{bmatrix} 0 & 0 & 1 & 0 & 1 & 0 & 1 & 1 \\ 0 & 0 & 0 & 1 & 0 & 1 & 0 & 1 \\ 0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 1 & 1 & 0 & 1 & 1 \\ 1 & 0 & 1 & 1 & 0 & 1 & 1 & 0 \\ 0 & 1 & 0 & 1 & 1 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 1 & 1 & 0 & 1 \\ 0 & 1 & 0 & 1 & 0 & 1 & 1 & 0 \end{bmatrix}} \end{matrix}$ Application of the Map Table

One advantage of using the map tables for the multiplication operations in the Galois Field is to avoid the operations of shifting digits or looking up the log table/inverse log table. All it needs is the XOR operations.

Take GF(2⁸) as an example. Suppose Y is the product of a constant 20 and an arbitrary number X, i.e., Y=20·X, and the map table associated with 20 (the matrix M₂₀) is given as: $\begin{matrix} {M_{20} = \begin{bmatrix} 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 \\ 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 1 & 0 & 1 & 1 & 0 & 1 \\ 0 & 1 & 0 & 1 & 0 & 1 & 1 & 0 \\ 0 & 0 & 1 & 0 & 1 & 0 & 1 & 1 \\ 0 & 0 & 0 & 1 & 0 & 1 & 0 & 1 \end{bmatrix}} & (11) \end{matrix}$

According to the definition, $\begin{matrix} \begin{matrix} {Y = \begin{bmatrix} y_{0} \\ y_{1} \\ y_{2} \\ y_{3} \\ y_{4} \\ y_{5} \\ y_{6} \\ y_{7} \end{bmatrix}} \\ {= {\begin{bmatrix} 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 \\ 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 1 & 0 & 1 & 1 & 0 & 1 \\ 0 & 1 & 0 & 1 & 0 & 1 & 1 & 0 \\ 0 & 0 & 1 & 0 & 1 & 0 & 1 & 1 \\ 0 & 0 & 0 & 1 & 0 & 1 & 0 & 1 \end{bmatrix} \cdot \begin{bmatrix} x_{0} \\ x_{1} \\ x_{2} \\ x_{3} \\ x_{4} \\ x_{5} \\ x_{6} \\ x_{7} \end{bmatrix}}} \\ {= \begin{bmatrix} {x_{4} + x_{6}} \\ {x_{5} + x_{7}} \\ {x_{0} + x_{4}} \\ {x_{1} + x_{4} + x_{5} + x_{6}} \\ {x_{0} + x_{2} + x_{4} + x_{5} + x_{7}} \\ {x_{1} + x_{3} + x_{5} + x_{6}} \\ {x_{2} + x_{4} + x_{6} + x_{7}} \\ {x_{3} + x_{5} + x_{7}} \end{bmatrix}} \end{matrix} & (12) \end{matrix}$

For example, if X=83, then Y=8, as given below: ${\begin{bmatrix} x_{0} \\ x_{1} \\ x_{2} \\ x_{3} \\ x_{4} \\ x_{5} \\ x_{6} \\ x_{7} \end{bmatrix} = \begin{bmatrix} 1 \\ 1 \\ 0 \\ 0 \\ 1 \\ 0 \\ 1 \\ 0 \end{bmatrix}},{\begin{bmatrix} y_{0} \\ y_{1} \\ y_{2} \\ y_{3} \\ y_{4} \\ y_{5} \\ y_{6} \\ y_{7} \end{bmatrix} = {\begin{bmatrix} {x_{4} + x_{6}} \\ {x_{5} + x_{7}} \\ {x_{0} + x_{4}} \\ {x_{1} + x_{4} + x_{5} + x_{6}} \\ {x_{0} + x_{2} + x_{4} + x_{5} + x_{7}} \\ {x_{1} + x_{3} + x_{5} + x_{6}} \\ {x_{2} + x_{4} + x_{6} + x_{7}} \\ {x_{3} + x_{5} + x_{7}} \end{bmatrix} = {\begin{bmatrix} {1 + 1} \\ {0 + 0} \\ {1 + 1} \\ {1 + 1 + 0 + 1} \\ {1 + 0 + 1 + 0 + 0} \\ {1 + 0 + 0 + 1} \\ {0 + 1 + 1 + 0} \\ {0 + 0 + 0} \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \\ 0 \\ 0 \\ 0 \\ 0 \end{bmatrix}}}}$

If the value of Y is computed using the conventional technique by looking up the log table/inverse log table, then Y=20·83=2²⁰⁶·2⁵²=2²⁰⁶⁺⁵²=2²⁵⁸=2²⁵⁸⁻²⁵⁵=2³=8 which is the same as the result computed by the disclosed technique of the invention. Explanation of the Algorithm

The disclosed algorithm of the invention allows the operations of a huge amount of Galois Field multiplication to proceed at the same time, particularly the multiplication operations of a constant with a lot of different numbers. Therefore, it speeds up the operations in a RAID system.

Please refer to FIG. 1. According to one embodiment of the invention, the disclosed method includes three steps. First, the domain of GF(2^(a)) of the Galois Field is determined. The map tables of all values in GF(2^(a)) are produced according to the algebraic rules of the Galois Field and stored in the memory (step 200). Secondly, the XOR operation unit is enlarged to appropriate w bits. Therefore, the multiplication unit is enlarged to be w a bits (step 300). Thirdly, according to the stored map tables and its operational rules, each data sector of w bits in the multiplication unit are selected as an XOR operation unit for the XOR operation when the system computes the multiplication of the Galois Field on-line (step 400). Wherein, the map tables mentioned in the first step can be generated in real time while processing data operations, instead of being all generated right after the system is turned on. However, if all the map tables can be generated right after the system is power on, it will be more convenient for subsequent operations. On the other hand, if the required map tables are too many and not suitable for production and storage at a time, then real-time generation during the operation is another feasible option.

How to generate the map tables (step 200) is already described above.

The technique of how to enlarge the XOR operation unit to w bits (step 300) is described as follows.

According to the definition of the map table, i.e. Eq. (9), y_(i) and x_(i) denote the i-th bit of Y and X, respectively, where Y and X are numbers in GF(2^(a)). It implies that when the map tables are used for conventional operations, the XOR operation unit is 1 bit and the multiplication unit is a number in GF(2^(a)). The disclosed method of the invention enlarges the XOR operation unit to w bits, and thus the multiplication unit is enlarged to w·a bits. Take GF(2⁸) as an example. If setting w=32, then the XOR operation unit has 32 bits according to the invention, and the multiplication unit has 32·8=256 bits=32 bytes, namely, the set of 32 numbers in GF(2⁸).

One of the chief considerations of selecting the length of the XOR operation unit to be w is the system hardware environment. For example, the consideration could be the operation unit of the CPU or dedicated XOR operation unit or the width of the data bus. If the operation unit of the CPU or dedicated XOR operation unit is 32 bits, then w=32 is an appropriate choice. If the operation unit of the CPU or dedicated XOR operation unit is 64 bits, then setting w=64 is suitable. Of course, it does not imply that the choice of w is necessarily limited to be the same as the length of the operation unit of the CPU or dedicated XOR operation unit. Different w values may be used in other embodiments of the invention.

Another factor influencing the value of w is considering that the basic storage unit (a sector) of the disks had better be an integer multiple of the multiplication unit. Take GF(2⁸) as an example. If setting w=20, then the multiplication unit has 20·8=160 bits=20 bytes. The basic storage unit, i.e. a sector, of the disks usually has 512 bytes. Since 512 is not an integer multiple of 20, therefore additional operations have to be performed when the multiplication unit is incomplete.

After determining the value of w, the system can perform online multiplication of the Galois Field according to the map tables (step 400). The multiplication may be performed for computing a parity or lost user data. The operation rule is still following Eq. (9). However, the XOR operation unit is enlarged to an appropriate w bits, and the multiplication unit is enlarged to w·a bits. That is, both y_(i) and x_(i) have w bits, and both Y and X have w·a bits.

In the following, an embodiment is used to explain the disclosed method. If it is the intention to calculate the product of Y=20·X in GF(2⁸). X is a 32-byte data sector. In the hexadecimal number system, X is represented as follows: $X = \begin{matrix} \quad \\ \begin{matrix} B_{0} & B_{4} & B_{8} & B_{12} \end{matrix} \\ \left| {25\quad 2a\quad 1b\quad 33} \middle| {52\quad 6a\quad 11\quad 90} \middle| {80\quad 46\quad 7c\quad{ab}} \middle| {6e\quad 21\quad 5b\quad 44} \right| \\ \begin{matrix} B_{16} & B_{20} & B_{24} & B_{28} \end{matrix} \\ \left| {{a5}\quad 42\quad 78\quad 03} \middle| {77\quad 25\quad 19\quad 64} \middle| {01\quad 92\quad 47\quad 86} \middle| {22\quad 55\quad 9a\quad 76} \right| \end{matrix}$ where the 0-th byte of X is denoted by B₀, the first byte by B₁, the second byte by B₂, and so on, until B₃₁.

According to the disclosed method, the RAID system computes and stores all the map tables when its starts. Therefore, the map table associated with 20 is already given. Suppose the system CPU is 32-bit. Therefore, w is set to be 32. In this case, Y and X are considered to be the data series composed of 8 units, given as: Y=y₀ y₁ y₂ y₃ y₄ y₅ y₆ y₇ X=x₀ x₁ x₂ x₃ x₄ x₅ x₆ x₇ where y_(i) and x_(i) represent operation units consisting of 32 bits (4 bytes), 0≦i≦7. ${{Set}\quad X} = \quad\begin{matrix} \quad \\ \begin{matrix} x_{0} & x_{1} & x_{2} & x_{3} \end{matrix} \\ \left| {25\quad 2a\quad 1b\quad 33} \middle| {52\quad 6a\quad 11\quad 90} \middle| {80\quad 46\quad 7c\quad{ab}} \middle| {6e\quad 21\quad 5b\quad 44} \right| \\ \begin{matrix} x_{4} & x_{5} & x_{6} & x_{7} \end{matrix} \\ \left| {{a5}\quad 42\quad 78\quad 03} \middle| {77\quad 25\quad 19\quad 64} \middle| {01\quad 92\quad 47\quad 86} \middle| {22\quad 55\quad 9a\quad 76} \right| \end{matrix}$

The map table of the constant 20 is already given in Eq. (11). Using Eqs. (9) and (12), one obtains (in the hexadecimal system): y ₀ =x ₄ +x ₆=(a5 42 78 03)+(01 92 47 86)=(a4 d0 3f 85) y ₁ =x ₅ +x ₇=(77 25 19 64)+(22 55 9a 76)=(55 70 83 12) y ₂ =x ₀ +x ₄=(25 2a 1b 33)+(a5 42 78 03)=(80 68 63 30) y ₃ =x ₁ +x ₄ +x ₅ +x ₆=(52 6a 11 90)+(a5 42 78 03)+(77 25 19 64)+(01 92 47 86)=(81 9f 37 71) y ₄ =x ₀ +x ₂ +x ₄ +x ₅ +x ₇=(25 2a 1 33)+(80 46 7c ab)+(a5 42 78 03)+(77 25 19 64)+(01 92 47 86)=(55 5e 9c 89) y ₅ =x ₁ +x ₃ +x ₅ +x ₆=(52 6a 11 90)+(6e 21 5b 44)+(77 25 19 64)+(01 92 47 86)=(4a fc 14 36) y ₆ =x ₂ +x ₄ +x ₆ +x ₇=(80 46 7c ab)+(a5 42 78 03)+(01 92 47 86)+(22 55 9a 76)=(06 c3 d9 58) y ₇ =x ₃ +x ₅ +x ₇=(6e 21 5b 44)+(77 25 19 64)+(22 55 9a 76)=(3b 51 d8 56)

-   -   Therefore, Y=|a4 d0 3f 85|55 70 83 12|80 68 63 30|81 9f 37 71|         |55 5e 9c 89|4a fc 14 36|06 c3 d9 58|3b 51 d8 56|

The above example assumes that the length of X is 32 bytes. If the length of X is greater than 32 bytes, then X is divided into groups each composed of 32 bytes. Each group of 32 byte forms a multiplication unit. Therefore, the product Y can be obtained by repeating the above operations.

Features of the Algorithm

Using the disclosed algorithm of the invention on the RAID system, the obtained parity is different from that obtained in the prior art. However, its effect and the way of application are completely the same as the prior art.

For example, suppose D₀, D₁, and D₂ are three disk drives for storing user data, which are 32-byte data series, shown as follows (expressed in the hexadecimal system): $D_{0} = \begin{matrix} {B_{0}\quad B_{4}{\quad\quad\quad}B_{8}\quad B_{12}} \\ {\quad\left. {{{2a\quad 16\quad 10\quad 36}}50\quad 14\quad 18\quad 66} \middle| {5c\quad 01\quad 06\quad 12{{35\quad 7e\quad 46\quad 0a}}} \right.} \\ {B_{16\quad}B_{20}\quad B_{24\quad}B_{28}} \\ \left. {{{1a\quad 39\quad 6f\quad 17}}59\quad 75\quad 48\quad 5d} \middle| {2a\quad 07\quad 57\quad 39{{0f\quad 30\quad 21\quad 30}}} \right. \end{matrix}$ $D_{1} = \begin{matrix} {B_{0}\quad B_{4}\quad B_{8}\quad B_{12}} \\ \left. {{{19\quad 38\quad 25\quad 26}}0c\quad 49\quad 57\quad 51} \middle| {6a\quad 35\quad 27\quad 65{{23\quad 09\quad 62\quad 28}}} \right. \\ {B_{16\quad}\quad B_{20}\quad B_{24}{\quad\quad}B_{28}} \\ \left. {{{58\quad 7f\quad 5d\quad 7e}}12\quad 15\quad 5d\quad 7a} \middle| {3d\quad 48\quad 4c\quad 6b{{5b\quad 40\quad 74\quad 4c}}} \right. \end{matrix}$ $D_{2} = \begin{matrix} {B_{0}{\quad\quad}B_{4}\quad B_{8}\quad B_{12}} \\ \left. {{{7c\quad 1c\quad 5d\quad 22}}3d\quad 61\quad 7d\quad 3c} \middle| {75\quad 2b\quad 3e\quad 70{{14\quad 4e\quad 42\quad 18}}} \right. \\ {B_{16}{\quad\quad}B_{20}\quad B_{24}{\quad\quad}B_{28}} \\ \left. {{{6d\quad 0d\quad 6e\quad 05}}31\quad 55\quad 78\quad 47} \middle| {3b\quad 72\quad 67\quad 70{{1f\quad 0b\quad 14\quad 3e}}} \right. \end{matrix}$ where B₀ denotes the 0-th byte, B₁ the first byte, and so on, until B₃₁. The RAID6 system comprising the three user data disk drives requires additional two party data disk drives for storing parities P and Q. According to Eqs. (1) and (2), one obtains: P=D ₀ +D ₁ +D ₂ Q=2⁰ ·D ₀+2¹ ·D+2² ·D ₂

In the prior art, the values of P and Q in GF(2⁸) are computed as follows: $P = \begin{matrix} {B_{0}\quad B_{4}{\quad\quad}B_{8}\quad B_{12}} \\ \left. {{{4f\quad 32\quad 68\quad 32}}61\quad 3c\quad 32\quad 0b} \middle| {43\quad 1f\quad 1f\quad 07{{02\quad 39\quad 66\quad 3a}}} \right. \\ {B_{16}\quad B_{20}\quad B_{24}\quad B_{28}} \\ \left. {{{2f\quad 4b\quad 5c\quad 6c}}7a\quad 35\quad 6d\quad 60} \middle| {2c\quad 3d\quad 7c\quad 22{{4b\quad 7b\quad 41\quad 42}}} \right. \end{matrix}$ $Q = \begin{matrix} {B_{0}{\quad\quad}B_{4}\quad B_{8}\quad B_{12}} \\ \left. {{{f\quad 5\quad 16\quad 33\quad f\quad 2}}{bc}\quad 1f\quad 5f\quad 34} \middle| {41\quad c\quad 7\quad b\quad 0\quad 05{{23\quad 49\quad 97\quad 3a}}} \right. \\ {B_{16}{\quad\quad}B_{20}{\quad\quad}B_{24}{\quad\quad}B_{28}} \\ \left. {{{03\quad{f3}\quad 70\quad f\quad f}}b\quad 9\quad 16\quad 0f\quad a\quad 8} \middle| {{bc}\quad 42\quad 4\quad e\quad 32{{{c5}\quad 9\quad c\quad 99\quad 50}}} \right. \end{matrix}$

Using the disclosed method of the invention, the P value is unchanged. The value of Q is as follows (assuming w=32): $Q = \begin{matrix} {B_{0}{\quad\quad}B_{4}\quad B_{8}\quad B_{12}} \\ \left. {{{4a\quad 24\quad 03\quad 0a}}56\quad 27\quad 29\quad 7e} \middle| {4c\quad 66\quad 1f\quad 5d{{1d\quad 13\quad 1b\quad 51}}} \right. \\ {B_{16}\quad B_{20}\quad B_{24}\quad B_{28}} \\ \left. {{{33\quad 22\quad 34\quad 4d}}0a\quad 4f\quad 43\quad 05} \middle| {55\quad 1f\quad 64\quad 46{{03\quad 2d\quad 15\quad 1c}}} \right. \end{matrix}$

Suppose the data in D₀ and D₂ are damaged, they can be recovered by using D₁, P, and Q. Using Eqs. (3), (4), (5), (6), (7), and (8), one obtains: x=0 , y=2 , A=166 , B=167; D ₀=166·P+167·Q+245·D ₁ D ₂ =P+D ₁ +D ₀   (13)

1. In the prior art, each byte is computed one by one to solve: 166·P=|e 9a d2 9a|2d 30 9a ae|05 be be 55|51 34 78 c3||75 5c bb 70|31 cf d6 8b|82 96 c2 28|5c 97 54 a3| 167·Q=|31 57 0f 63|75 a1 13 5d|15 99 82 01|ad 44 89 f9||f4 c4 49 33|74 57 03 71|75 e1 16 a8|ca 2c 2d 10| 245·D ₁ =|e5 db cd cf|08 85 91 95|4c 26 3a 46|c9 0e b7 30||9b a1 9d 54|1c ed 9d a7|dd 70 83 b9|99 8b 58 83|

Therefore, D ₀=2a 16 10 36|50 14 18 66|5c 01 06 12|35 7e 46 0a||1a 39 6f 17|59 75 48 5d|2a 07 57 39|0f 30 21 30| D₂ is then obtained by substituting D₀ in Eq. (13).

2. According to the disclosed method of the invention, one obtains: 166·P=|52 4b 78 13|0f 5b 57 7b|4f 32 68 32|33 77 4a 18||51 3d 58 5d|3e 15 7b 59|7e 76 04 31|44 20 16 39| 167·Q=|08 72 67 3c|36 58 65 22|06 42 1c 57|09 62 56 19||17 49 00 70|63 52 59 40|42 56 64 36|60 7f 4c 5c| 245·D ₁=|70 2f 0f 19|69 17 2a 3f|15 71 72 77|0f 6b 5a 0b| |5 c 4d 37 3a|04 32 6a 44|16 27 37 3e|2b 6f 7b 55|

Therefore, D ₀=|2a 16 10 36|50 14 18 66|5c 01 06 12|35 7e 46 0a||1a 39 6f 17|59 75 48 5d|2a 07 57 39|0f 30 21 30| Likewise, D₂ is obtained by substituting D₀ in Eq. (13).

The above example reveals that even though the value of Q obtained by the techniques disclosed in the invention is different from the one computed by the prior art, however, the functions of protecting and recovering the user data are identical to the one in the prior art.

Correctness of the Algorithm and its Mathematical Meaning

Take GF(2⁸) as an example. Suppose Y and X are composed of 8 XOR operation units, each of which has a length of w bits. Here w is an appropriate number, such as 32 in the previous example. Y and X are represented in a vector format as follows, ${Y = \begin{bmatrix} y_{0} \\ y_{1} \\ y_{2} \\ \vdots \\ y_{7} \end{bmatrix}},\quad{X = \begin{bmatrix} x_{0} \\ x_{1} \\ x_{2} \\ \vdots \\ x_{7} \end{bmatrix}}$ where y_(i) and x_(i) are w-bit numbers and 0≦i≦7.

Let Y=K·X, where K is a constant whose map table is the matrix M_(K). Then ${y_{i} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{i,j} \cdot x_{j}} \right)}},{{{wherein}\quad 0} \leqq i \leqq 7}$ That is, $y_{0} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{0,j} \cdot x_{j}} \right)}$ $y_{1} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{1,j} \cdot x_{j}} \right)}$ $y_{2} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{2,j} \cdot x_{j}} \right)}$ $y_{3} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{3,j} \cdot x_{j}} \right)}$ $y_{4} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{4,j} \cdot x_{j}} \right)}$ $y_{5} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{5,j} \cdot x_{j}} \right)}$ $y_{6} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{6,j} \cdot x_{j}} \right)}$ $y_{7} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{7,j} \cdot x_{j}} \right)}$

Let y_(i,j) and x_(i,j) denote the j-th bits of y_(i) and x_(i), respectively, where 0≦i≦7 and 0≦j≦w−1. Since both y_(i) and x_(i) have w bits, the above equations can be unfolded as follows: $\begin{matrix} {{y_{0,0} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{0,j} \cdot x_{j,0}} \right)}}{{y_{0,1} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{0,j} \cdot x_{j,1}} \right)}},{{\ldots\quad{and}\quad{so}\quad{forth}\quad{until}\quad y_{0,{w - 1}}} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{0,j} \cdot x_{j,{w - 1}}} \right)}}}} & (14) \\ {{y_{1,0} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{1,j} \cdot x_{j,0}} \right)}}{{y_{1,1} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{1,j} \cdot x_{j,1}} \right)}},{{{\ldots and}\quad{so}\quad{forth}\quad{until}\quad y_{1,{w - 1}}} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{1,j} \cdot x_{j,{w - 1}}} \right)}}}} & (15) \\ {{y_{2,0} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{2,j} \cdot x_{j,0}} \right)}}{{y_{2,1} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{2,j} \cdot x_{j,1}} \right)}},{{{\ldots and}\quad{so}\quad{forth}\quad{until}\quad y_{2,{w - 1}}} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{2,j} \cdot x_{j,{w - 1}}} \right)}}}} & (16) \\ {{y_{3,0} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{3,j} \cdot x_{j,0}} \right)}}{{y_{3,1} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{3,j} \cdot x_{j,1}} \right)}},{{{\ldots and}\quad{so}\quad{forth}\quad{until}\quad y_{3,{w\quad - \quad 1}}} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{3,j} \cdot x_{j,{w\quad - \quad 1}}} \right)}}}} & (17) \\ {{y_{4,0} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{4,j} \cdot x_{j,0}} \right)}}{{y_{4,1} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{4,j} \cdot x_{j,1}} \right)}},{{{\ldots and}\quad{so}\quad{forth}\quad{until}\quad y_{4,{w - 1}}} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{4,j} \cdot x_{j,\quad{w - 1}}} \right)}}}} & (18) \\ {{y_{5,0} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{5,j} \cdot x_{j,0}} \right)}}{{y_{5,1} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{5,j} \cdot x_{j,1}} \right)}},{{{\ldots and}\quad{so}\quad{forth}\quad{until}\quad y_{5,{w - 1}}} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{5,j} \cdot x_{j,{w - 1}}} \right)}}}} & (19) \\ {{y_{6,0} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{6,j} \cdot x_{j,0}} \right)}}{{y_{6,1} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{6,j} \cdot x_{j,1}} \right)}},{{{\ldots and}\quad{so}\quad{forth}\quad{until}\quad y_{6,{w - 1}}} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{6,j} \cdot x_{j,{w - 1}}} \right)}}}} & (20) \\ {{y_{7,0} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{7,j} \cdot x_{j,0}} \right)}}{{y_{7,1} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{7,j} \cdot x_{j,1}} \right)}},{{{\ldots and}\quad{so}\quad{forth}\quad{until}\quad y_{7,{w - 1}}} = {\sum\limits_{j = 0}^{7}\quad\left( {m_{7,j} \cdot x_{j,{w - 1}}} \right)}}}} & (21) \end{matrix}$

Analyzing Eqs. (14) to (21), one finds: $\begin{bmatrix} y_{0,0} \\ y_{1,0} \\ y_{2,0} \\ \vdots \\ y_{7,0} \end{bmatrix} = {\begin{bmatrix} m_{0,0} & m_{0,1} & m_{0,2} & \cdots & m_{0,7} \\ m_{1,0} & m_{1,1} & m_{1,2} & \cdots & m_{1,7} \\ m_{2,0} & m_{2,1} & m_{2,2} & \cdots & m_{2,7} \\ \vdots & \vdots & \vdots & \quad & \vdots \\ m_{7,0} & m_{7,1} & m_{7,2} & \cdots & m_{7,7} \end{bmatrix}_{K} \cdot \begin{bmatrix} x_{0,0} \\ x_{1,0} \\ x_{2,0} \\ \vdots \\ x_{7,0} \end{bmatrix}}$

That is, (y_(0,0) y_(1,0) . . . y_(7,0)) and (x_(0,0) x_(1,0) . . . x_(7,0)) satisfy the definition of the map table in Eq. (9). Therefore, the former one is the product of K and the latter one in the Galois Field. Likewise, the numbers of (y_(0,j) y_(1,j) . . . y_(7,j)) for all j satisfying 0≦j≦w−1 are the products of K and (x_(0,j) x_(1,j) . . . x_(7,j)).

The above-mentioned analysis provides a mathematical meaning for the disclosed technique. Please refer to FIG. 3 and take GF(2⁸) as an example. The Galois Field products obtained according to the invention is equivalent to the results obtained from the following steps:

-   -   1. Read the data sector with a length of (w·8) bits, where w is         an appropriate value as described above.     -   2. In the data sector, start from the i-th bit and pick one bit         every w bits, until it forms a GF(2⁸) number x_(i), wherein         0≦i≦7.     -   3. Obtaiń y_(i)=K·x_(i), wherein 0≦i≦7, using the conventional         techniques.     -   4. Store y_(i) back to the memory address where stores the final         multiplication product. The location of each bit of y_(i) should         move back to the one corresponding to the original location in         x_(i), wherein 0≦i≦7.

From the viewpoint of the “equivalent method” mentioned above, the disclosed method of the invention still follows the algebraic principles of the Galois Field. The difference from the prior art is the way of data sampling. That is, the disclosed method of the invention can be regarded as being equivalent to sampling one bit every w bits in the data sector until a GF(2^(a)) number is obtained.

For example, as shown in FIG. 3, suppose an XOR operation unit has w bits of a data length, and 8 XOR operation units form a multiplication unit. One embodiment of the invention is considered to be equivalent to the multiplication result outlined in the following steps. Step1, pick the first bit of each XOR operation unit to form an 8-bit number (b₀b₁b₂b₃b₄b₅b₆b₇). Multiply K by (b₀b₁b₂b₃b₄b₅b₆b₇) to obtain (b₀′b₁′b₂′b₃′b₄b₅′b₆′b₇′). Then, put each bit of (b₀′b₁′b₂′b₃′b₄′b₅′b₆ 40 b₇′) back to the corresponding location where the original (b₀b₁b₂b₃b₄b₅b₆b₇) comes from. Step2, perform the operation with the same K on the number (c₀c₁c₂c₃c₄c₅c₆c₇) formed by picking the second bit of each XOR operation unit and then obtain (c₀′c₁′c₂′c₃′c₄′c₅′c₆′c₇′). Put each bit of (c₀′c₁′c₂′c₃′c₄′c₅₀′c₆′c₇′) back to the corresponding location where the original (c₀c₁c₂c₃c₄c₅c₆c₇) comes from. This procedure repeats until all the w·8 bits are computed.

In contrast, the prior art samples data in sequence, as shown in FIG. 4. The product of each byte with K has to be computed one by one. Therefore, it is difficult to enlarge the data amount computed so as to speed up the operation.

From the equivalent point of view mentioned above, although the invention has different sampling method from the prior art, this does not affect the correctness of Eqs. (2) to (8). Therefore, the functions of data protecting and recovering remain the same.

The above-mentioned “equivalent method” is only for explaining the essence of the invention. In practice, the disclosed method of the invention can simultaneously compute several Galois Field products, thereby increasing the operation speed of the RAID system. This advantage originates from the special data sampling method in the “equivalent method”.

System Structure Using the Disclosed Algorithm

In an embodiment of the invention, the disclosed method is applied to a redundant array of independent disk (RAID) subsystem. With reference to FIG. 5, the physical storage device (PSD) array 600 consists of several disk drives. When a host 10 accesses the PSD array 600, the entire PSD array 600 is regarded as a single logic disk drive. The primary objective of a storage virtualization controller (SVC) 100 is to map the combination of all sectors in the disk drives to form a logic disk drive visible to the host 10. After an I/O request sent out from the host 10 is received by the controller 100, the 110 request is first analyzed and interpreted. The related operations and data are then compiled into I/O requests of the disk drives.

In this embodiment, the SVC 100 comprises a host-side I/O device interconnect controller 120, a central processing circuit (CPC) 140, a memory 180, and a device-side 110 device interconnect controller 500. Although these components are described using individual functional blocks, in practice some or even all the functional blocks can be integrated on a single chip.

The host-side I/O device interconnect controller 120 is connected to the host 10 and the CPC 140 to be the interface and buffer between the SVC 100 and the host 10. It receives the 110 requests and the related data transmitted from the host 10 and converts and/or maps them to the CPC 140.

The memory 180 is connected to the CPC 140 to be a buffer. It buffers the data transmitted between the host 10 and the PSD array 600 that pass through the CPC 140. The device-side I/O device interconnect controller 500 is disposed between the CPC 140 and the PSD array 600 to be the interface and buffer between the SVC 100 and the PSD array 600. The device-side I/O device interconnect controller 500 receives the I/O requests and the related data transmitted from the CPC 140 and maps and/or transmits them to the PSD array 600.

The CPC 140 includes a CPU chipset 144 that has a parity engine 160, a central processing unit (CPU) 142, a read only memory (ROM) 146, and a non-volatile random access memory (NVRAM) 148. The CPU 142 can be, for example, a Power PC CPU. The ROM 146 can be a flash memory for storing the basic input/output system (BIOS) and/or other programs. The CPU 142 is coupled via the CPU chipset 144 to other electronic devices (e.g., the memory 180). The NVRAM 148 is used to store information related to the status of I/O operations on the PSD array 600, so that the information can be used as a check when the power is unexpectedly shut down before the I/O operations are finished. The ROM 146, the NVRAM 148, an LCD module 550, and an enclosure management service (EMS) circuit 560 are coupled to the CPU chipset 144 via an X-bus. Moreover, the NVRAM 148 is optional; namely, it may be omitted in other embodiment. Although the CPU chipset 144 is described as a functional block integrated with the parity engine 160, they can be disposed separately on different chips in practice.

In an embodiment of the invention, the target data processed in the multiplication operations may come from the PSD array 600 or the host 10. The multiplication result may be stored in the memory 180, the disk drives of the PSD 600, or the buffer built in the parity engine 160 or the CPU 142 (not shown in the drawing). The algorithm of the invention is implemented by program coding. The program can be stored in the ROM 146 or the memory 180 for the CPC 140 to execute. In other words, the CPC 140 is responsible for generating map tables corresponding to the numbers in a field domain (e.g., GF(2⁸)) during power on or on line. The generated map tables can be stored in the memory 180. In another embodiment of the invention, all the necessary map tables can be computed in advance and stored in the ROM 146 or the memory 180 so that the CPC 140 only needs to access the stored map tables after power on. During the online real-time operations, for a given multiplication unit, an XOR operation unit is taken as an unit to perform an XOR operation on the target data stored in the memory according to the map tables. The multiplication result is then obtained after several the XOR operations.

Although in the above embodiment, disks are taken as an example for the physical storage devices (PSDs) used in the RAID subsystem, it is noted that other kinds of physical storage devices, such as CD, DVD, etc., can be used alternatively, depending on different demands of the market.

The invention being thus described, it will be obvious that the same may be varied in many ways. Such variations are not to be regarded as a departure from the spirit and scope of the invention, and all such modifications as would be obvious to one skilled in the art are intended to be included within the scope of the following claims. 

1. A method for processing data multiplication in a PSD array, comprising the steps of: generating at least one map table associated with at least one value in a field; selecting the length of an XOR operation unit and forming a multiplication unit by combining a plurality of the XOR operation units; and performing at least one XOR operation using the XOR operation unit as one unit while computing on the multiplication unit of data provided by a data source according to the at least one map table, and performing a plurality of the XOR operations to obtain the multiplication result.
 2. The method of claim 1, wherein a plurality of the multiplication results are further computed by at least one XOR operation to obtain a parity or a user data set.
 3. The method of claim 2, wherein the parity is obtained using the following formula: Q=g ⁰ ·D ₀ +g ¹ ·D ₁ +g ² ·D ₂ +. . . +g ⁻¹ ·D _(n−1) where g is a generator of a Galois Field and given to be 2; D₀, D₁, D₂, . . . , D_(n−1) denote user data series of n number of user data PSDs, respectively; “+” represents an XOR operation; and “·” represents the multiplication operation of the Galois Field.
 4. The method of claim 1, wherein the user data set is obtained using the following formula: D _(x) =A·(P+P _(xy))+B·(Q+Q _(xy)) D _(y)=(P+P _(xy))+D _(x) where x and y are the serial numbers of two data PSDs with errors; D_(x) and D_(y) are user data corresponding to the two data PSDs x and y; A and B are constants only dependent upon x and y: A=g ^(y−x)·(g ^(y−x)+1)⁻¹ B=g ^(−x)·(g ^(y−x)+1)⁻¹ P_(xy) and Q_(xy) are the values of P and Q, respectively, when D_(x) and D_(y) are both 0, i.e., P _(xy) +D _(x) +D _(y) =P Q _(xy) +g ^(x) ·D _(x) +g ^(y) ·D _(y) =Q where “+” represents an XOR operation; and “·” represents the multiplication operation of the Galois Field.
 5. The method of claim 1, wherein the field is a Galois Field.
 6. The method of claim 5, wherein the map table is generated according to an algorithmic rule of the Galois Field.
 7. The method of claim 6, wherein the algorithmic rule is generated according to the algebraic rules of the Galois Field.
 8. The method of claim 6, wherein when the domain of the Galois Field is GF(2⁸) the algorithmic rule is: m′ _(0,j) =m _(7j), 0≦j≦7 m′ _(1,j) =m _(0,j), 0≦j≦7 m′ _(2,j) =m _(1,j) +m _(7,j), 0≦j≦7 m′ _(3,j) =m _(2,j) +m _(7,j), 0≦j≦7 m′ _(4,j) =m _(3,j) +m _(7,j), 0≦j≦7 m′ _(5,j) =m _(4,j), 0≦j≦7 m′ _(6,j) =m _(5,j), 0≦j≦7 m′ _(7,j) =m _(6,j), 0≦j≦7 where m_(0,j)˜m_(7,j) and m′_(0,j)˜m′_(7,j) with 0_<j 7 are elements of matrixes M_(K) and M_(K′), respectively, M_(K) being a given matrix associated with K, M_(K′) being a matrix associated with K′=2·K wherein K≠0.
 9. The method of claim 8, wherein when K=0 the matrix M₀ is a zero matrix.
 10. The method of claim 8, wherein when K=2⁰=1 the matrix M₁ is an identity matrix.
 11. The method of claim 1, wherein the at least one XOR operation is performed according to the following formula: $Y = {\begin{bmatrix} y_{0} \\ y_{1} \\ y_{2} \\ \vdots \\ y_{a - 1} \end{bmatrix} = {{M_{K} \cdot X} = {\begin{bmatrix} m_{0,0} & m_{0,1} & m_{0,2} & \cdots & m_{0,{a - 1}} \\ m_{1,0} & m_{1,1} & m_{1,2} & \cdots & m_{1,{a - 1}} \\ m_{2,0} & m_{2,1} & m_{2,2} & \cdots & m_{2,{a - 1}} \\ \vdots & \vdots & \vdots & \quad & \vdots \\ m_{{a - 1},0} & m_{{a - 1},1} & m_{{a - 1},2} & \cdots & m_{{a - 1},{a - 1}} \end{bmatrix}_{K} \cdot \begin{bmatrix} x_{0} \\ x_{1} \\ x_{2} \\ \vdots \\ x_{a - 1} \end{bmatrix}}}}$ ${namely},{y_{i} = {\sum\limits_{j = 0}^{a - 1}\quad\left( {m_{ij} \cdot x_{j}} \right)}}$ where M_(K) is a matrix representing the map table associated with K; m_(i,j) represent elements in the matrix M_(K) with 0≦i,j≦a−1, and m _(i,j) ·x _(j) =x _(j), if m _(i,j)=1 m _(i,j) ·x _(j)=0, if m _(i,j)=0 where x₀, x₁, x₂, . . . , and x_(a−1) represent data whose length is the same as the XOR operation unit, respectively, X represents data of the multiplication unit; and Y represents the result of multiplying K by X.
 12. The method of claim 8, wherein the XOR operation performed according to the map tables is the one selecting the data of the XOR operation unit whose corresponding elements in the same row of the matrix M are 1 to do the XOR operation.
 13. The method of claim 1, wherein the length of the XOR operation unit is determined according to the processing unit of a central processing unit (CPU) or a dedicated XOR operation unit of the PSD array.
 14. The method of claim 1, wherein the length of the XOR operation unit is 32 bits or 64 bits.
 15. The method of claim 1, wherein the length of the multiplication unit is 32 bytes or 64 bytes.
 16. The method of claim 1, wherein the length of the XOR operation unit is greater than 1 bit.
 17. The method of claim 1, wherein the data source is a physical storage device (PSD) array or a computer host.
 18. A controller for processing data multiplication in a PSD array, comprising: a memory for temporarily storing target data provided by a data source; and a central processing circuit (CPC) for generating at least one map table associated with at least one value in a field, performing at least one XOR operation using the XOR operation unit as one unit while computing on a multiplication unit of the target data stored in the memory according to one map table of the at least one map table, and performing a plurality of the XOR operations to obtain the multiplication result.
 19. The controller of claim 18, wherein before the CPC performs the multiplication operation, the length of the XOR operation unit is given, and a plurality of the XOR operation units form the multiplication unit.
 20. The controller of claim 18, wherein the CPC further includes a CPU chipset that has a parity engine, a CPU, a read only memory (ROM), and a non-volatile random access memory (NVRAM).
 21. The controller of claim 18, wherein the data source is a PSD array or a computer host for providing the target data for the multiplication operation.
 22. The controller of claim 21 further comprising a device-side I/O device interconnect controller connected between the PSD array and the CPC as a buffer interface for receiving an I/O request and related data transmitted from the CPC and mapping and/or transmitting them to the PSD array.
 23. The controller of claim 21 further comprising a host-side I/O device interconnect controller connected between the host and the CPC as a buffer interface for receiving an I/O request and related data transmitted from the host and converting and/or mapping them to the CPC.
 24. The controller of claim 18, wherein the field is a Galois Field and the map table is generated according to an algorithmic rule of the Galois Field.
 25. The controller of claim 24, wherein when the domain of the Galois Field is GF(2⁸), the algorithmic rule is: m′ _(0,j) =m _(7,j), 0≦j≦7 m′ _(1,j) =m _(0,j), 0≦j≦7 m′ _(2,j) =m _(1,j) +m _(7,j), 0≦j≦7 m′ _(3,j) =m _(2,j) +m _(7,j), 0≦j≦7 m _(4,j) =m _(3,j) +m _(7,j), 0≦j≦7 m′ _(5,j) =m _(4,j), 0≦j≦7 m′ _(7,j) =m _(6,j), 0≦j≦7 where m_(0,j)˜m_(7,j) and m′_(0,j)˜m′_(7,j) with 0≦j≦7 are elements of matrixes M_(K) and M_(K′), respectively, M_(K) being a given matrix associated with K, M_(K′) being a matrix associated with K′=2·K wherein K≠0.
 26. The controller of claim 25, wherein when K=0 the matrix M₀ is a zero matrix.
 27. The controller of claim 25, wherein when K=2⁰=1 the matrix M₁ is an identity matrix.
 28. The controller of claim 18, wherein the at least one XOR operation is performed according to the following formula: $Y = {\begin{bmatrix} y_{0} \\ y_{1} \\ y_{2} \\ \vdots \\ y_{a - 1} \end{bmatrix} = {{M_{K} \cdot X} = {\begin{bmatrix} m_{0,0} & m_{0,1} & m_{0,2} & \cdots & m_{0,{a - 1}} \\ m_{1,0} & m_{1,1} & m_{1,2} & \cdots & m_{1,{a - 1}} \\ m_{2,0} & m_{2,1} & m_{2,2} & \cdots & m_{2,{a - 1}} \\ \vdots & \vdots & \vdots & \quad & \vdots \\ m_{{a - 1},0} & m_{{a - 1},1} & m_{{a - 1},2} & \cdots & m_{{a - 1},{a - 1}} \end{bmatrix}_{K} \cdot \begin{bmatrix} x_{0} \\ x_{1} \\ x_{2} \\ \vdots \\ x_{a - 1} \end{bmatrix}}}}$ ${namely},{y_{i} = {\sum\limits_{j = 0}^{a - 1}\quad\left( {m_{ij} \cdot x_{j}} \right)}}$ where M_(K) is a matrix representing the map table associated with K; m_(i,j) represent elements in the matrix M_(K) with 0≦i, j≦a−1, and m _(i,j) ·x _(j) =x _(j), if m _(i,j)=1 m _(i,j) ·x _(j)=0, if m _(i,j)=0 where x₀, x₁, x₂, . . . , and X_(a−1) represent data whose length is the same as the XOR operation unit, respectively, X represents data of the multiplication unit; and Y represents the result of multiplying K by X.
 29. The controller of claim 18, wherein the length of the XOR operation unit is determined according to the processing unit of a central processing unit (CPU) or a dedicated XOR operation unit of the PSD array.
 30. The controller of claim 18, wherein the length of the XOR operation unit is 32 bits or 64 bits.
 31. The controller of claim 18, wherein the length of the multiplication unit is 32 bytes or 64 bytes.
 32. The controller of claim 18, wherein the length of the XOR operation unit is greater than 1 bit.
 33. A method for processing data multiplication in a PSD array for computing the product of a number K and a data series X, comprising the steps of: generating a map table associated with the number K; selecting the length of an XOR operation unit and forming a multiplication unit by combining a plurality of the XOR operation units; dividing the data series X into at least one of the multiplication unit; performing at least one XOR operation using the XOR operation unit as one unit while computing on the multiplication unit according to the map table associated with the number K and the rules of the map table; and performing the multiplication operations in the previous step on all the multiplication units of the data series X; wherein the multiplication result of the number K with the data series X is obtained when all the multiplication operations are finished. 